A Computational Treatment Of Coordinate Conjunctions

SUMMARY The present paper describes a computational solution to the problem of locating words that are zeroed under conjunction. In this solution, which is based on general properties 3f conjunctional constructions, a mechanism locates zeroed elements in the conjunction strings and cross-references them d t h respect to elements in the h e a d construction. Constraints can then be a p p l i e d to elided conjuncts a s though t h e y w e r e expanded, and transformational expansion, which reconstructs the complete sentences underlying conjunctional occurrences, can be carried out straightforwardly by following the pointers which have been set up.